Binary division follows a process similar to decimal division, where the dividend is divided by the divisor to obtain the quotient and remainder. Here are the general steps for binary division:

1. Setup:
   - Align the divisor (denominator) and the dividend (numerator) so that the leftmost bit of the divisor aligns with the leftmost bit of the dividend.
   - Set the quotient to zero and initialize the remainder with the dividend.

2. Division Steps:
   - Starting from the leftmost bit of the dividend, perform the following steps until the entire dividend is processed:
     - Subtract the divisor from the current portion of the remainder.
     - If the result is non-negative, append '1' to the quotient. If negative, append '0' to the quotient.
     - Bring down the next bit from the dividend.

3. Continue Iterations:
   - Repeat the subtraction and appending steps until all bits in the dividend are processed.

4. Result:
   - The quotient is the final result, and the remainder (if any) is the remainder after the division.

Let's go through an example to illustrate binary division:

Example: 10101 (Dividend) ÷ 11 (Divisor)

```
            1 0 1 0 1  (Dividend)
         ______________
    11 | 1 0 1 0 1 0
        -1 1               (Subtract 11, quotient = 0)
        ____
           0 1 0          (Bring down the next bit)
             - 1 1        (Subtract 11, quotient = 1)
             _____
                1 0 0     (Bring down the next bit)
                  -1 1   (Subtract 11, quotient = 10)
                  _____
                      1   (Bring down the next bit)
                      -1 1 (Subtract 11, quotient = 101)
                      _____
                         0 (No more bits to bring down)

Result: Quotient = 101, Remainder = 0
```

In this example, the binary division of 10101 by 11 results in a quotient of 101 and no remainder. This illustrates the basic steps involved in binary division.